Communication among Agents: a Set Theoretic Approach
نویسندگان
چکیده
This paper uses the notion of relative sets in relation to fuzzy set theory to provide a mathematical framework to analyze communication among agents. Each relative set partitions all objects into four distinct regions corresponding to four truth-values of Belnap’s logic. Two orderings on relative sets are considered; one is an extension of the classical set inclusion ordering while the other is a new ordering of knowledge or information. According to these orderings, we can divide set theoretic problems into two major categories: reasoning problems and communicating problems. In the first category, an agent tries to extract a sound decision through granular reasoning. In this case, a granule represents a concept or a word. In the second category, each granule relates to an agent, and the problem is to compare agents’ knowledge about concepts by their related granules, e.g. a knowledge reduction problem. Then, we concentrate on the second category of problems and try to investigate this kind of problems in the context of fuzzy set theory. In this way, we could provide a basis for modeling and analyzing the relations among machines, which could communicate with each other using words and granules.
منابع مشابه
Some results on a supergraph of the comaximal ideal graph of a commutative ring
Let R be a commutative ring with identity such that R admits at least two maximal ideals. In this article, we associate a graph with R whose vertex set is the set of all proper ideals I of R such that I is not contained in the Jacobson radical of R and distinct vertices I and J are joined by an edge if and only if I and J are not comparable under the inclusion relation. The aim of this article ...
متن کاملSome results on the complement of a new graph associated to a commutative ring
The rings considered in this article are commutative with identity which are not fields. Let R be a ring. A. Alilou, J. Amjadi and Sheikholeslami introduced and investigated a graph whose vertex set is the set of all nontrivial ideals of R and distinct vertices I, J are joined by an edge in this graph if and only if either ann(I)J = (0) or ann(J)I = (0). They called this graph as a new graph as...
متن کاملHierarchical Functional Concepts for Knowledge Transfer among Reinforcement Learning Agents
This article introduces the notions of functional space and concept as a way of knowledge representation and abstraction for Reinforcement Learning agents. These definitions are used as a tool of knowledge transfer among agents. The agents are assumed to be heterogeneous; they have different state spaces but share a same dynamic, reward and action space. In other words, the agents are assumed t...
متن کاملStructural Controllability of a Consensus Network with Multiple Leaders
This paper examines the structural controllability for a group of agents, called followers, connected to each other based on the consensus law under commands of multiple leaders, which are agents with superior capabilities, over a fixed communication topology. It is proved that the graph-theoretic sufficient and necessary condition for the set of followers to be structurally controllable under ...
متن کاملCoordinating multi-agent reinforcement learning with limited communication
Coordinated multi-agent reinforcement learning (MARL) provides a promising approach to scaling learning in large cooperative multiagent systems. Distributed constraint optimization (DCOP) techniques have been used to coordinate action selection among agents during both the learning phase and the policy execution phase (if learning is off-line) to ensure good overall system performance. However,...
متن کامل